Polynomial-time approximation scheme - PDFSEARCH.IO - Document Search Engine

Polynomial-time approximation scheme
Results: 52

#	Item
11	Theoretical Computer Science–2863 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2014-11-26 08:32:25 Computational complexity theory Approximation algorithms Complexity classes Operations research NP-complete problems Polynomial-time approximation scheme Travelling salesman problem Steiner tree problem APX Optimization problem Combinatorial optimization NP
12	Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one Add to Reading List Source URL: www2.informatik.hu-berlin.de Language: English - Date: 2014-06-25 03:14:23 Computational complexity theory Theory of computation Complexity classes Packing problems NP-complete problems Bin packing problem Approximation algorithms Polynomial-time approximation scheme Partition problem NP NC Time complexity
13	SIAM J. COMPUT. Vol. 43, No. 1, pp. 312–336 c 2014 Society for Industrial and Applied Mathematics Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-02-27 01:13:13 Computational complexity theory Operations research Complexity classes Polynomial-time approximation scheme Mechanism design Optimization problem Approximation algorithm Time complexity Mathematical optimization Exact algorithm Single-parameter utility Perturbation theory
14	A Note about Weak ε-nets for Axis-Parallel Boxes in d-space∗ Esther Ezra† Abstract We show the existence of weak ε-nets of size O (1/ε log log (1/ε)) for point sets and axisparallel boxes in Rd , for d ≥ 4. Our Add to Reading List Source URL: www.cims.nyu.edu Language: English - Date: 2010-03-16 11:23:28 Computational geometry Ε-net Time complexity Polynomial-time approximation scheme Theoretical computer science Mathematics Applied mathematics
15	Mathematical Programming manuscript No. (will be inserted by the editor) Sanjeev Arora ? Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2007-02-04 13:37:22 NP-complete problems Complexity classes Approximation algorithms Spanning tree Travelling salesman problem Polynomial-time approximation scheme Time complexity Optimization problem Algorithm Theoretical computer science Computational complexity theory Applied mathematics
16	Flexible Resource Allocation for Optical Networks Dmitriy Katz1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NY 10598. Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-04-27 19:14:38 Operations research Computational complexity theory Approximation algorithms Complexity classes Mathematical optimization Polynomial-time approximation scheme Dynamic programming Linear programming Algorithm Theoretical computer science Applied mathematics Mathematics
17	On Two Class-Constrained Versions of the Multiple Knapsack Problem ∗ Hadas Shachnai † Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-15 10:32:13 Operations research Combinatorial optimization NP-complete problems Mathematical optimization Dynamic programming Knapsack problem Job shop scheduling Optimization problem Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
18	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Privacy by Fake Data: A Geometric Approach Victor Alvarez∗ Erin Chambers† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Complexity classes Structural complexity theory Mathematical optimization Approximation algorithms Ε-net NP Polynomial-time approximation scheme Reduction Packing problem Theoretical computer science Computational complexity theory Applied mathematics
19	Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints∗ Ariel Kulik† Hadas Shachnai‡ Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2011-10-04 12:29:59 Approximation algorithms Complexity classes Polynomial-time approximation scheme Optimization problem APX Parameterized complexity Bin packing problem PTAS reduction Theoretical computer science Applied mathematics Computational complexity theory
20	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Distributed Algorithm for Approximate Mobile Sensor Coverage Esther Ezra∗ Jiemin Zeng† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-29 13:44:18 NP-complete problems Complexity classes Approximation algorithms Operations research Set cover problem Polynomial-time approximation scheme Time complexity Linear programming relaxation NP Theoretical computer science Computational complexity theory Applied mathematics